Search results for "Quantum computer"

Erratum: “Concentric transmon qubit featuring fast tunability and an anisotropic magnetic dipole moment” [Appl. Phys. Lett. 108, 032601 (2016)]

2018

Solid-State Molecular Nanomagnet Inclusion into a Magnetic Metal-Organic Framework: Interplay of the Magnetic Properties.

2015

Single-ion magnets (SIMs) are the smallest possible magnetic devices and are a controllable, bottom-up approach to nanoscale magnetism with potential applications in quantum computing and high-density information storage. In this work, we take advantage of the promising, but yet insufficiently explored, solid-state chemistry of metal-organic frameworks (MOFs) to report the single-crystal to single-crystal inclusion of such molecular nanomagnets within the pores of a magnetic MOF. The resulting host-guest supramolecular aggregate is used as a playground in the first in-depth study on the interplay between the internal magnetic field created by the long-range magnetic ordering of the structur…

Biomolecular computers with multiple restriction enzymes

2017

Abstract The development of conventional, silicon-based computers has several limitations, including some related to the Heisenberg uncertainty principle and the von Neumann “bottleneck”. Biomolecular computers based on DNA and proteins are largely free of these disadvantages and, along with quantum computers, are reasonable alternatives to their conventional counterparts in some applications. The idea of a DNA computer proposed by Ehud Shapiro’s group at the Weizmann Institute of Science was developed using one restriction enzyme as hardware and DNA fragments (the transition molecules) as software and input/output signals. This computer represented a two-state two-symbol finite automaton t…

Magic informationally complete POVMs with permutations

2017

Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation [M. Planat and Rukhsan-Ul-Haq, Preprint 1701.06443]. We show in this paper that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs. Such IC-POVMs, investigated in dimensions $2$ to $12$, exhibit simple finite geometries in their projector products and, for dimensions $4$ and $8$ and $9$, relate to two-qubit, three-qubit and two-qutrit contextuality.

Algebraic Results on Quantum Automata

2004

We use tools from the algebraic theory of automata to investigate the class of languages recognized by two models of Quantum Finite Automata (QFA): Brodsky and Pippenger’s end-decisive model, and a new QFA model whose definition is motivated by implementations of quantum computers using nucleo-magnetic resonance (NMR). In particular, we are interested in the new model since nucleo-magnetic resonance was used to construct the most powerful physical quantum machine to date. We give a complete characterization of the languages recognized by the new model and by Boolean combinations of the Brodsky-Pippenger model. Our results show a striking similarity in the class of languages recognized by th…

Quantum state engineering using one-dimensional discrete-time quantum walks

2017

Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin, and providing …

Spin qubits with electrically gated polyoxometalate molecules

2007

Spin qubits offer one of the most promising routes to the implementation of quantum computers. Very recent results in semiconductor quantum dots show that electrically-controlled gating schemes are particularly well-suited for the realization of a universal set of quantum logical gates. Scalability to a larger number of qubits, however, remains an issue for such semiconductor quantum dots. In contrast, a chemical bottom-up approach allows one to produce identical units in which localized spins represent the qubits. Molecular magnetism has produced a wide range of systems with tailored properties, but molecules permitting electrical gating have been lacking. Here we propose to use the polyox…

Debates with Small Transparent Quantum Verifiers

2014

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E.

Knot Theory, Jones Polynomial and Quantum Computing

2005

Knot theory emerged in the nineteenth century for needs of physics and chemistry as these needs were understood those days. After that the interest of physicists and chemists was lost for about a century. Nowadays knot theory has made a comeback. Knot theory and other areas of topology are no more considered as abstract areas of classical mathematics remote from anything of practical interest. They have made deep impact on quantum field theory, quantum computation and complexity of computation.

Optical d-level frequency-time-based cluster states

2019

Cluster states, a specific class of multi-partite entangled states, are of particular importance for quantum science, as such systems are equivalent to the realization of one-way (or measurement-based) quantum computers [1]. In this scheme, algorithms are implemented through high-fidelity measurements on the parties of the state [2]. While two-level (i.e. qubit) cluster states have been realized so far, increasing the number of particles to boost the computational resource comes at the price of significantly reduced coherence time and detection rates, as well as increased sensitivity to noise, restricting the realization of discrete cluster states to a record of eight qubits. In contrast, t…